Parity of a permutation

Results: 103



#Item
21CCCG 2009, Vancouver, BC, August 17–19, 2009  On symmetric realizations of the simplicial complex of 3-crossing-free sets of diagonals of the octagon∗ J¨ urgen Bokowski‡

CCCG 2009, Vancouver, BC, August 17–19, 2009 On symmetric realizations of the simplicial complex of 3-crossing-free sets of diagonals of the octagon∗ J¨ urgen Bokowski‡

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2009-09-02 14:20:09
22THE APPLICATION OF RESTRICTED COUNTER SCHEMES TO THREE MODELS OF LINEAR SEARCH Micha Hofri† and Hadas Shachnai‡ December 1991

THE APPLICATION OF RESTRICTED COUNTER SCHEMES TO THREE MODELS OF LINEAR SEARCH Micha Hofri† and Hadas Shachnai‡ December 1991

Add to Reading List

Source URL: www.cs.technion.ac.il

Language: English - Date: 2005-12-15 16:29:08
23Secure Efficient History-Hiding Append-Only Signatures in the Standard Model Benoˆıt Libert  Marc Joye

Secure Efficient History-Hiding Append-Only Signatures in the Standard Model Benoˆıt Libert Marc Joye

Add to Reading List

Source URL: www.iacr.org

Language: English - Date: 2015-03-31 04:04:52
24An Action Language for Reasoning about Beliefs in Multi-Agent Domains Chitta Baral and Gregory Gelfond Enrico Pontelli and Tran Cao Son  Ira A. Fulton School of Engineering

An Action Language for Reasoning about Beliefs in Multi-Agent Domains Chitta Baral and Gregory Gelfond Enrico Pontelli and Tran Cao Son Ira A. Fulton School of Engineering

Add to Reading List

Source URL: myweb.ttu.edu

Language: English - Date: 2015-05-24 18:08:51
25An Innocent Investigation D. Joyce, Clark University January 2006 The beginning. Have you ever wondered why every number is either even or odd? I don’t mean to ask if you ever wondered whether every number

An Innocent Investigation D. Joyce, Clark University January 2006 The beginning. Have you ever wondered why every number is either even or odd? I don’t mean to ask if you ever wondered whether every number

Add to Reading List

Source URL: aleph0.clarku.edu

Language: English - Date: 2014-08-12 16:34:20
26ON THE OPTIMALITY OF THE COUNTER SCHEME FOR DYNAMIC LINEAR LISTS Micha Hofri† and Hadas Shachnai Computer Science Department The Technion - Israel Institute of Technology, Haifa 32000, Israel

ON THE OPTIMALITY OF THE COUNTER SCHEME FOR DYNAMIC LINEAR LISTS Micha Hofri† and Hadas Shachnai Computer Science Department The Technion - Israel Institute of Technology, Haifa 32000, Israel

Add to Reading List

Source URL: www.cs.technion.ac.il

Language: English - Date: 2005-12-15 16:29:35
27

PDF Document

Add to Reading List

Source URL: www.iacr.org

Language: English - Date: 2015-03-27 08:32:48
28Addressing Covert Termination and Timing Channels in Concurrent Information Flow Systems Deian Stefan1 Alejandro Russo2

Addressing Covert Termination and Timing Channels in Concurrent Information Flow Systems Deian Stefan1 Alejandro Russo2

Add to Reading List

Source URL: www.scs.stanford.edu

Language: English - Date: 2012-09-18 17:22:52
29Aachen Department of Computer Science Technical Report Inferring Lower Bounds for Runtime Complexity

Aachen Department of Computer Science Technical Report Inferring Lower Bounds for Runtime Complexity

Add to Reading List

Source URL: sunsite.informatik.rwth-aachen.de

Language: English - Date: 2015-04-22 11:31:05
30Microsoft Word - A new identity-based strong designated verifier signature scheme1115.doc

Microsoft Word - A new identity-based strong designated verifier signature scheme1115.doc

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2008-12-01 03:09:27